Presburger Arithmetic with Unary Predicates Is 1 1 Complete
نویسنده
چکیده
We give a simple proof characterizing the complexity of Pres-burger arithmetic augmented with additional predicates. We show that Pres-burger arithmetic with additional predicates is 1 1 complete. Adding one unary predicate is enough to get 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse.
منابع مشابه
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the known boundary between decidable and undecidable in that we show that the purely universal fragment of the extended theory is already undecidable. Our proof is ...
متن کاملUnary Pushdown Automata and Straight-Line Programs
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed m...
متن کاملExpansions of MSO by cardinality relations
We study expansions of the Weak Monadic Second Order theory of (N, <) by cardinality relations, which are predicates R(X1, . . . , Xn) whose truth value depends only on the cardinality of the sets X1, . . . , Xn. We first provide a (definable) criterion for definability of a cardinality relation in (N, <), and use it to prove that for every cardinality relation R which is not definable in (N, <...
متن کاملBounding Quantification in Parametric Expansions of Presburger Arithmetic
Generalizing Cooper’s method of quantifier elimination for Presburger arithmetic, we give a new proof that all parametric Presburger families {St : t ∈ N} (as defined by Woods in [8]) are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial f ∈ Z[t]. In fact, this quantifier bounding method works more g...
متن کاملDefinable Types in Presburger Arithmetic
We consider the first order theory of (Z,+, <), also known as Presburger arithmetic. We prove a characterization of definable types in terms of prime models over realizations, which has a similar flavor to the Marker-Steinhorn Theorem of o-minimality. We also prove that a type over a model is definable if and only if it has a unique coheir to any elementary extension, which is a characterizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991